Kings in multipartite hypertournaments
نویسندگان
چکیده
In his paper Kings in Bipartite Hypertournaments (Graphs $\&$ Combinatorics 35, 2019), Petrovic stated two conjectures on 4-kings multipartite hypertournaments. We prove one of these and give counterexamples for the other.
منابع مشابه
Score lists in multipartite hypertournaments
Given non-negative integers ni and αi with 0 ≤ αi ≤ ni (i = 1, 2, . . . , k), an [α1, α2, . . . , αk]-k-partite hypertournament on ∑k 1 ni vertices is a (k+ 1)-tuple (U1, U2, . . . , Uk, E), where Ui are k vertex sets with |Ui| = ni, and E is a set of ∑k 1 αi-tuples of vertices, called arcs, with exactly αi vertices from Ui, such that any ∑k 1 αi subset ∪ k 1U ′ i of ∪ k 1Ui, E contains exactly...
متن کاملKings in semicomplete multipartite digraphs
A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a semicom-plete p-partite digraph, or just a semicomplete multipartite digraph. A semicomplete multipartite digraph with no cycle of length two is a multipartite tournament. In a digraph D, an r-king is a vertex q such that every vertex in D ...
متن کاملOn the 3-kings and 4-kings in multipartite tournaments
Koh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-king in [K.M. Koh, B.P. Tan, Kings in multipartite tournaments, Discrete Math. 147 (1995) 171–183, Theorem 2]. In Theorem 1 of this paper, we extend this result to n-partite tournaments, where n 3. In [K.M. Koh, B.P. Tan, Number of 4-kings in bipartite tournaments with no 3-kings, Discrete Math. 154 (1996)...
متن کاملThe number of kings in a multipartite tournament
We show that in any n-partite tournament, where n/> 3, with no transmitters and no 3-kings, the number of 4-kings is at least eight. All n-partite tournaments, where n/>3, having eight 4-kings and no 3-kings are completely characterized. This solves the problem proposed in Koh and Tan (accepted).
متن کاملVertex-pancyclicity of hypertournaments
Abstract: A hypertournament or a k-tournament, on n vertices, 2≤k≤n, is a pair T= (V,E), where the vertex setV is a set of size n and the edge setE is the collection of all possible subsets of size k of V, called the edges, each taken in one of its k! possible permutations. A k-tournament is pancyclic if there exists (directed) cycles of all possible lengths; it is vertex-pancyclic if moreover ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2021
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22726